منابع مشابه
On Cubical Graphs 5
It is frequently of interest to represent a given graph G as a subgraph of a graph H which has some special structure. A particularly useful class of graphs in which to embed G is the class of n-dimensional cubes. This has found applications , for example, in coding theory, data transmission, and linguistics. In this note, we study the structure of those graphs 6, called cubical graphs (not to ...
متن کاملGraphs of Acyclic Cubical Complexes
It is well known that chordal graphs are exactly the graphs of acyclic simplicial complexes . In this note we consider the analogous class of graphs associated with acyclic cubical complexes . These graphs can be characterized among median graphs by forbidden convex subgraphs . They possess a number of properties (in analogy to chordal graphs) not shared by all median graphs . In particular , w...
متن کاملRecognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination schemes and showed that the graphs of acyclic cubical complexes are retracts of cubes characterized by certain forbidden convex subgraphs. In this paper we present an algorithm of time complexity O(m log n) which recog...
متن کاملVariation on Cubical sets
In the model presented in [1, 4] a type is interpreted by a nominal set A equipped with two “face” operations: if u : A and i is a symbol we can form u(i = 0) : A(i = 0) and u(i = 1) : A(i = 1) elements independent of i. The unit interval is represented by the nominal set I, whose elements are 0, 1 and the symbols. Alternatively, we have a presentation as a presheaf category over the category w...
متن کاملOn the key exchange with new cubical maps based on graphs
Families of edge transitive algebraic graphs Fn(K), over the commutative ring K were used for the graph based cryptographic algorithms. We introduce a key exchange protocol defined in terms of bipartite graph An(K), n ≥ 2 with point set Pn and line set Ln isomorphic to n-dimensional free module K. Graphs A(n,K) are not vertex and edge transitive. There is a well defined projective limit limA(n,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1975
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90067-2